MAYBE 86.28
↳ HASKELL
↳ LR
((mapAndUnzipM :: Monad b => (d -> b (c,a)) -> [d] -> b ([c],[a])) :: Monad b => (d -> b (c,a)) -> [d] -> b ([c],[a])) |
import qualified Maybe import qualified Prelude |
|||||
mapAndUnzipM :: Monad d => (c -> d (a,b)) -> [c] -> d ([a],[b])
|
import qualified Monad import qualified Prelude |
\xs→return (x : xs)
sequence0 x xs = return (x : xs)
\x→sequence cs >>= sequence0 x
sequence1 cs x = sequence cs >>= sequence0 x
\(a,b)~(as,bs)→(a : as,b : bs)
unzip0 (a,b) ~(as,bs) = (a : as,b : bs)
↳ HASKELL
↳ LR
↳ HASKELL
↳ IPR
((mapAndUnzipM :: Monad c => (a -> c (b,d)) -> [a] -> c ([b],[d])) :: Monad c => (a -> c (b,d)) -> [a] -> c ([b],[d])) |
import qualified Monad import qualified Prelude |
import qualified Maybe import qualified Prelude |
|||||
mapAndUnzipM :: Monad d => (c -> d (b,a)) -> [c] -> d ([b],[a])
|
~(as,bs)
unzip00 (as,bs) = as
unzip01 (as,bs) = bs
↳ HASKELL
↳ LR
↳ HASKELL
↳ IPR
↳ HASKELL
↳ BR
((mapAndUnzipM :: Monad b => (a -> b (c,d)) -> [a] -> b ([c],[d])) :: Monad b => (a -> b (c,d)) -> [a] -> b ([c],[d])) |
import qualified Maybe import qualified Prelude |
|||||
mapAndUnzipM :: Monad a => (b -> a (c,d)) -> [b] -> a ([c],[d])
|
import qualified Monad import qualified Prelude |
↳ HASKELL
↳ LR
↳ HASKELL
↳ IPR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((mapAndUnzipM :: Monad b => (d -> b (a,c)) -> [d] -> b ([a],[c])) :: Monad b => (d -> b (a,c)) -> [d] -> b ([a],[c])) |
import qualified Monad import qualified Prelude |
import qualified Maybe import qualified Prelude |
|||||
mapAndUnzipM :: Monad c => (a -> c (d,b)) -> [a] -> c ([d],[b])
|
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
↳ HASKELL
↳ LR
↳ HASKELL
↳ IPR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
(mapAndUnzipM :: Monad d => (a -> d (c,b)) -> [a] -> d ([c],[b])) |
import qualified Maybe import qualified Prelude |
|||||
mapAndUnzipM :: Monad b => (c -> b (a,d)) -> [c] -> b ([a],[d])
|
import qualified Monad import qualified Prelude |